Factual Correctness Guarantees to Secure Distance Vector Routing Protocols Table of Contents List of Figures
نویسندگان
چکیده
Routing is one of the key functions of the Internet, and routing protocols form an inseparable part of the Internet infrastructure. Without accurate routing information, packet forwarding can be drastically affected and potentially even cause a network-wide blackout. The routing protocols in use today were designed during the more benign days of the Internet and operate on implicit trust between the routers, which may not always hold in today’s Internet. Routing protocols can be broadly classified into Link State Routing protocols, Distance Vector Routing protocols, and Path Vector Routing protocols. In this work, we primarily focus on designing robust security mechanisms to augment the different distance vector routing protocols in use today. By definition, the distance vector routing updates are essentially distributed computational results of the nodes in the network and carry only the distance information for every reachable destination. As the routing tables are thus computed in a distributed manner, with limited knowledge at each individual router, we are forced to employ an implicit trust model to guarantee correctness. We introduce the concept of Factual Correctness as a means of quantifying and validating this implicit trust in the network. We propose a neighbor-update-propagation model that can ensure factual correctness and also detect malicious activity by any mis-behaving router in the network. We then propose a secure routing protocol based on this model, employing simple cryptographic primitives and operating with minimal additional overhead. We also perform a detailed security evaluation to analyze the different strong and weak security guarantees that can be provided by the proposed modifications to the distance vector routing protocols, in any network in which it has been deployed.
منابع مشابه
Secure Routing Using Factual Correctness
The routing protocols in use today operate on implicit trust among the different routers. Specifically, the distance vector routing (DVR) protocols compute routing tables in a distributed manner, based on this implicit trust. This trust model however fails to ensure the factual correctness of the routing updates, which is very critical for secure routing. We propose a neighbor update propagatio...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملA Reinforcement Learning Approach for Secure Routing in Mobile
THAI)............................................................................ I ABSTRACT (ENGLISH)...................................................................... II ACKNOWLEDGEMENTS............................................................. IV TABLE OF CONTENTS...................................................................... V LIST OF FIGURES......................................
متن کاملSecure Routing Protocols Using Consistency Checks and S-RIP
Internet routing infrastructures are vulnerable to various attacks due to the lack of strong authentication mechanisms, software vulnerabilities/misconfiguration, and the risky assumption of a trustworthy and cooperative environment. Existing solutions do not solve the problem because they neither validate factual correctness of routing updates nor support incremental deployment. In this paper,...
متن کاملEfficient Security Mechanisms for Routing Protocolsa
As our economy and critical infrastructure increasingly rely on the Internet, securing routing protocols becomes of critical importance. In this paper, we present four new mechanisms as tools for securing distance vector and path vector routing protocols. For securing distance vector protocols, our hash tree chain mechanism forces a router to increase the distance (metric) when forwarding a rou...
متن کامل